The relationship between k-forcing and k-power domination
نویسندگان
چکیده
منابع مشابه
The minus k-domination numbers in graphs
For any integer , a minus k-dominating function is afunction f : V (G) {-1,0, 1} satisfying w) for every vertex v, where N(v) ={u V(G) | uv E(G)} and N[v] =N(v)cup {v}. The minimum of the values of v), taken over all minusk-dominating functions f, is called the minus k-dominationnumber and is denoted by $gamma_k^-(G)$ . In this paper, we introduce the study of minu...
متن کاملthe relationship between critical thinking and reading strategies
during the process of reading, sometimes learners use ineffective and inefficient strategies and some factors may influence their use of strategies. perhaps critical thinking is one of these factors. this study aims to identify those categories of reading strategies that are mostly used by iranian efl learners and to see if there is any significant relationship between the critical thinking abi...
the relationship between collocational competence and listening comprehension
پس از پیدایش روش تدریس tpr توسط جیمز اشر که توجه و تآکید بسیاری بر مهارت شنیداری داشت زبانشناسان همواره در صدد یافتن راههایی برای بهبود این مهارت در زبان آموزان می باشند. از طرفی جی-آر-فرث که از پیشگامان زبانشناسی می باشد بر تآثیر لغات و بویژه گروه کلمات که اغلب در گفتار با هم می آیند (هم آیی کلمات)تأکید بسیار کرده است. به این دلیل و به منظوربررسی رابطه بین این دو عامل یعنی درک شنیداری و دانش...
15 صفحه اولWeak signed Roman k-domination in graphs
Let $kge 1$ be an integer, and let $G$ be a finite and simple graph with vertex set $V(G)$.A weak signed Roman $k$-dominating function (WSRkDF) on a graph $G$ is a function$f:V(G)rightarrow{-1,1,2}$ satisfying the conditions that $sum_{xin N[v]}f(x)ge k$ for eachvertex $vin V(G)$, where $N[v]$ is the closed neighborhood of $v$. The weight of a WSRkDF $f$ is$w(f)=sum_{vin V(G)}f(v)$. The weak si...
متن کاملRoman k-Tuple Domination in Graphs
For any integer $kgeq 1$ and any graph $G=(V,E)$ with minimum degree at least $k-1$, we define a function $f:Vrightarrow {0,1,2}$ as a Roman $k$-tuple dominating function on $G$ if for any vertex $v$ with $f(v)=0$ there exist at least $k$ and for any vertex $v$ with $f(v)neq 0$ at least $k-1$ vertices in its neighborhood with $f(w)=2$. The minimum weight of a Roman $k$-tuple dominatin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2018
ISSN: 0012-365X
DOI: 10.1016/j.disc.2017.10.031